On monophonic sets in graphs

نویسندگان

  • Carmen Hernando
  • Mercè Mora
  • Ignacio M. Pelayo
  • Carlos Seara
چکیده

In this paper we study monophonic sets in a connected graph G. First, we present a realization theorem proving, that there is no general relationship between monophonic and geodetic hull sets. Second, we study the contour of a graph, introduced by Cáceres and alt. [2] as a generalization of the set of extreme vertices where the authors proved that the contour of a graph is a g-hull set; in this work we show that the contour must also be monophonic. Finally, we focus our attention on the so-called edge Steiner sets. We prove that every edge Steiner set W in G is edge monophonic, i.e., every edge of G lies on some monophonic path joining two vertices of W .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel

A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path  $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A  detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex  of at most on...

متن کامل

On monophonic sets in graphs1

Classical convexity can be naturally translated to graphs considering shortest paths, giving rise to the geodesic convexity. Moreover, if we consider induced paths between vertices, we get the so-called monophonic convexity. In this work, we present some results involving monophonic sets.

متن کامل

The Connected Monophonic Number of a Graph

For a connected graph G = (V, E), a monophonic set of G is a set M � V (G) such that every vertex of G is contained in a monophonic path joining some pair of vertices in M. The monophonic number m (G) of G is the minimum order of its monophonic sets and any monophonic set of order m (G) is a minimum monophonic set of G. A connected monophonic set of a graph G is a monophonic set M such that the...

متن کامل

Forcing Total Detour Monophonic Sets in a Graph

For a connected graph G = (V,E) of order at least two, a total detour monophonic set of a graph G is a detour monophonic set S such that the subgraph induced by S has no isolated vertices. The minimum cardinality of a total detour monophonic set of G is the total detour monophonic number of G and is denoted by dmt(G). A subset T of a minimum total detour monophonic set S of G is a forcing total...

متن کامل

Monophonic Distance in Graphs

For any two vertices u and v in a connected graph G, a u − v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) is the length of a longest u − v monophonic path in G. For any vertex v in G, the monophonic eccentricity of v is em(v) = max {dm(u, v) : u ∈ V}. The subgraph induced by the vertices of G having minimum monophonic eccentricity is the monophonic ce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005